On Unimodal Subsequences
نویسنده
چکیده
In this paper we prove that any sequence of n real numbers contains a unimodal subsequence of length at least [(3n-3/4) " '-fj and that this bound is best possible.
منابع مشابه
Short note on complexity and approximability of unimodal partitions of permutations
We extend results of Wagner [8] and Fomin, Kratsch, and Novelle [6] on monotone partitions of permutations. We show that partitioning a sequence of distinct integers into unimodal subsequences is NP-complete and that a minimum unimodal partition is 3.42-approximable in polynomial time.
متن کاملOptimal Sequential Selection of a Unimodal Subsequence of a Random Sequence
We consider the problem of selecting sequentially a unimodal subsequence from a sequence of independent identically distributed random variables, and we find that a person doing optimal sequential selection does so within a factor of the square root of two as well as a prophet who knows all of the random observations in advance of any selections. Our analysis applies in fact to selections of su...
متن کاملIncreasing and Decreasing Subsequences and Their Variants
We survey the theory of increasing and decreasing subsequences of permutations. Enumeration problems in this area are closely related to the RSK algorithm. The asymptotic behavior of the expected value of the length is(w) of the longest increasing subsequence of a permutation w of 1, 2, . . . , n was obtained by Vershik-Kerov and (almost) by Logan-Shepp. The entire limiting distribution of is(w...
متن کاملMining Biological Repetitive Sequences Using Support Vector Machines and Fuzzy SVM
Structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. Biggest class of the repetitive subsequences is “Transposable Elements” which has its own sub-classes upon contexts’ structures. Many researches have been performed to criticality determine the structure and function of repetitiv...
متن کاملOn Minimum k-Modal Partitions of Permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result to minimum partitioning into k-modal subsequences; here unimodal is the special case k = 1. Based on a network flow interpretation we formulate both, the monotone and the k-modal version, as mixed integer programs. This is the first proposal to obtain provably optimal partition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1979